Robust Conjugate Duality for Convex Optimization under Uncertainty with Application to Data Classification∗
نویسندگان
چکیده
In this paper we present a robust conjugate duality theory for convex programming problems in the face of data uncertainty within the framework of robust optimization, extending the powerful conjugate duality technique. We first establish robust strong duality between an uncertain primal parameterized convex programming model problem and its uncertain conjugate dual by proving strong duality between the deterministic robust counterpart of the primal model and the optimistic counterpart of its dual problem under a regularity condition. This regularity condition is not only sufficient for robust duality but also is necessary for it whenever robust duality holds for every linear perturbation of the objective function of the primal model problem. More importantly, we show that robust strong duality always holds for partially finite convex programming problems under scenario data uncertainty and that the optimistic counterpart of the dual is a tractable finite dimensional problem. As an application, we also derive a robust conjugate duality theorem for support vector machines which are a class of important convex optimization models for classifying two labelled data sets. The support vector machine has emerged as a powerful modelling tool for machine learning problems of data classification that arise in many areas of application in information and computer sciences. ∗The authors are grateful to the referee and the Editor for their helpful comments and valuable suggestions which have contributed to the final preparation of the paper. Research was partially supported by a grant from the Australian Research Council and the Korea Science and Engineering Foundation NRL program grant of the Korea government (MEST)(No. ROA-2008-000-20010-0). †Department of Applied Mathematics, University of New South Wales, Sydney 2052, Australia. Email: [email protected] ‡Department of Applied Mathematics, University of New South Wales, Sydney 2052, Australia. Email: [email protected] §Department of Applied Mathematics, Pukyong National University, Busan 608-737, Korea.
منابع مشابه
Strong Duality in Robust Convex Programming: Complete Characterizations
Abstract. Duality theory has played a key role in convex programming in the absence of data uncertainty. In this paper, we present a duality theory for convex programming problems in the face of data uncertainty via robust optimization. We characterize strong duality between the robust counterpart of an uncertain convex program and the optimistic counterpart of its uncertain Lagrangian dual. We...
متن کاملRobust nonlinear optimization via the dual
Robust nonlinear optimization is not as well developed as the linear case, and limited in the constraints and uncertainty sets it can handle. In this work we extend the scope of robust optimization by showing how to solve a large class of robust nonlinear optimization problems. The fascinating and appealing property of our approach is that any convex uncertainty set can be used. We give an expl...
متن کاملRobust Duality for Generalized Convex Programming Problems under Data Uncertainty∗
In this paper we present a robust duality theory for generalized convex programming problems in the face of data uncertainty within the framework of robust optimization. We establish robust strong duality for an uncertain nonlinear programming primal problem and its uncertain Lagrangian dual by showing strong duality between the deterministic counterparts: robust counterpart of the primal model...
متن کاملRobust linear semi-infinite programming duality under uncertainty
In this paper, we propose a duality theory for semi-infinite linear programming problems under uncertainty in the constraint functions, the objective function, or both, within the framework of robust optimization. We present robust duality by establishing strong duality between the robust counterpart of an uncertain semi-infinite linear program and the optimistic counterpart of its uncertain La...
متن کاملStock Evaluation under Mixed Uncertainties Using Robust DEA Model
Data Envelopment Analysis (DEA) is one of the popular and applicable techniques for assessing and ranking the stocks or other financial assets. It should be noted that in the financial markets, most of the times, the inputs and outputs of DEA models are accompanied by uncertainty. Accordingly, in this paper, a novel Robust Data Envelopment Analysis (RDEA) model, which is capable to be used in t...
متن کامل